Zak transform as a framework for quantum computation with the Gottesman-Kitaev-Preskill code

نویسندگان

چکیده

The Gottesman-Kitaev-Preskill (GKP) code encodes a qubit into bosonic mode using periodic wave functions. This periodicity makes the GKP natural setting for Zak transform, which is tailor-made to provide simple description We review transform and its connection basis of states in Hilbert space, decompose shift operators that underpin stabilizers correctable errors, find transforms position function appear naturally error correction. construct subsystem decomposition (SSD)---the modular variable SSD---by dividing mode's expressed basis, virtual gauge mode. Tracing over gives logical-qubit state, preceding trace with particular logical-gauge interaction different logical state---that associated

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Bravyi-Kitaev transformation for quantum computation of electronic structure.

Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner transformation allows for representation of a fermionic operator by O(n) qubit operations. Here, we develop an alternative method of simulating fermions with qubit...

متن کامل

The Zak Transform ( s )

We introduce the operator Z that is often called the Zak transform. Our definition is a bit different from the one that usually appears in the literature. We will discuss this difference and will also give a historical account that the reader may find particularly interesting. In order to do this, however, we need to present our treatment of the operator Z (and Z̃) which shows that the Fourier t...

متن کامل

A Discrete Zak Transform

A discrete version of the Zak transform is defined and used to analyze discrete Weyl–Heisenberg frames, which are nonorthogonal systems in the space of square-summable sequences that, although not necessarily bases, provide representations of square-summable sequences as sums of the frame elements. While the general theory is essentially similar to the continuous case, major differences occur w...

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Semiclassical Fourier transform for quantum computation.

Shor’s algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement. It is shown that such a Fourier transform can be carried out in a semi-classical way in which a “classical” (macroscopic) signal resulting from the measurement of one bit (embodied in a twostate quantum system) is employed to determine the type of measuremen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2023

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.107.062611